Katz denies that organisms created in a lab as part of a de-extinction attempt will be authentic members of the extinct species, on the basis that they will lack the original species’ defining biological and evolutionary history. Against Katz, I note that an evolutionary lineage is conferred on an organism through its inheriting genes from forebears already possessed of such a lineage, and that de-extinction amounts to a delayed, human-assisted reproductive process, in which genes are inherited from forebears long dead. (...) My conclusion is that de-extinct organisms can perfectly well have an ancient evolutionary history, contrary to what Katz claims. (shrink)

Famous examples of conceivability arguments include (i) Descartes’ argument for mind-body dualism, (ii) Kripke's ‘modal argument’ against psychophysical identity theory, (iii) Chalmers’ ‘zombie argument’ against materialism, and (iv) modal versions of the ontological argument for theism. In this paper, we show that for any such conceivability argument, C, there is a corresponding ‘mirror argument’, M. M is deductively valid and has a conclusion that contradicts C's conclusion. Hence, a proponent of C—henceforth, a ‘conceivabilist’—can be warranted in holding that C's premises (...) are conjointly true only if she can find fault with one of M's premises. But M's premises are modelled on a pair of C's premises. The same reasoning that supports the latter supports the former. For this reason, a conceivabilist can repudiate M's premises only on pain of severely undermining C's premises. We conclude on this basis that all conceivability arguments, including each of (i)–(iv), are fallacious. (shrink)

The counterfactual account of physical computation is simple and, for the most part, very attractive. However, it is usually thought to trivialize the notion of physical computation insofar as it implies ‘limited pancomputationalism’, this being the doctrine that every deterministic physical system computes some function. Should we bite the bullet and accept limited pancomputationalism, or reject the counterfactual account as untenable? Jack Copeland would have us do neither of the above. He attempts to thread a path between the two horns (...) of the dilemma by buttressing the counterfactual account with extra conditions intended to block certain classes of deterministic physical systems from qualifying as physical computers. His theory is called the ‘algorithm execution account’. Here we show that the algorithm execution account entails limited pancomputationalism, despite Copeland’s argument to the contrary. We suggest, partly on this basis, that the counterfactual account should be accepted as it stands, pancomputationalist warts and all. (shrink)

David Lewis describes, then attempts to refute, a simple anti-Humean theory of desire he calls ‘Desire as Belief’. Lewis’ critics generally accept that his argument is sound and focus instead on trying to show that its implications are less severe than appearances suggest. In this paper I argue that Lewis’ argument is unsound. I show that it rests on an essential assumption that can be straightforwardly proven false using ideas and principles to which Lewis is himself committed.

This paper concerns the three great modal dichotomies: (i) the necessary/contingent dichotomy; (ii) the a priori/empirical dichotomy; and (iii) the analytic/synthetic dichotomy. These can be combined to produce a tri-dichotomy of eight modal categories. The question as to which of the eight categories house statements and which do not is a pivotal battleground in the history of analytic philosophy, with key protagonists including Descartes, Hume, Kant, Kripke, Putnam and Kaplan. All parties to the debate have accepted that some categories are (...) void. This paper defends the contrary view that all eight categories house statements—a position I dub ‘octopropositionalism’. Examples of statements belonging to all eight categories are given. (shrink)